Method for flow control for a number of transmitters with an unknown and/or different transmission power

ABSTRACT

A node to which message channels are connected is considered in a communication network. Traffic sources and traffic sinks are connected to the other end of these message channels. The transmission power of the traffic sources is unknown, and the traffic sources are not all always active. A number of message channels may be connected to one node. A protocol which has a window mechanism for controlling the number of messages which a traffic source may send without acknowledgement is used for reliable message transmission. In the event of reception overload, messages may be rejected in such a node. The present invention controls the window size on the basis of the number of received messages, and not at fixed time intervals. No measurements are carried out for inactive message channels, which are thus not associated with any computation capacity. Message channels which always completely fill their windows are controlled more frequency than message channels which do not completely fill their windows. This results in the window size of those message channels which always completely use their windows being continuously increased further during operation without overload, on the one hand, in order to take account of their transmission power. On the other hand, these message channels likewise are controlled more frequently in the event of overload, so that the node is more effectively protected against being overloaded.

BACKGROUND OF THE INVENTION

[0001] A node to which bidirectional message channels are connected for transmitting and receiving is considered in a communication network. Traffic sources and traffic sinks are connected to the other end of these message channels. The transmission power of the traffic sources is unknown, and the traffic sources are not all always active. A number of message channels may be connected to one node. A protocol which has a window mechanism for controlling the number of messages which a traffic source may send without acknowledgement is used for reliable message transmission.

[0002] A reception overload can occur in a node such as this if the messages arriving on the message channels exceed the capacity of the receiving device for that node. In this case, messages are rejected.

[0003] One problem is to find a suitable method for flow control which protects the node against being overloaded. This flow control must reliably cope with the following problem elements:

[0004] a small number of message channels have a high volume of traffic, which results in an overload situation;

[0005] a large number of message channels have a small amount of message traffic, producing an overload situation overall; and

[0006] no computation power should be consumed for flow control when a message channel is inactive, and little computation power should be consumed when a message channel has a small amount of message traffic;

[0007] One known solution to this problem is to define connection guidelines which restrict the number of message channels which can be connected to one node. This leads to a large amount of capacity being reserved in order to deal with overload situations which occur rarely.

[0008] A further known method solves the problem in two steps. In a first step, the window size is reduced to an estimated load which can be coped with, and fine adjustment is carried out in a second step, as a function of the overload indication. This can be used sensibly only for a small number of message channels with a known transmission power whose level is constantly high; in particular, this solution is not able to deal with inactive message channels without using computation power.

[0009] An object to which the present invention is directed, is to avoid the disadvantages of the previously known methods for flow control for a number of transmitters with an unknown and/or different transmission power.

SUMMARY OF THE INVENTION

[0010] Accordingly, one major aspect of the method of the present invention is the fact that the control process is based on a number of received messages, and is not based on fixed time intervals. This has the advantage that no measurements are carried out for inactive message channels, that is to say message channels on which no messages are being received, so that no computation capacity is associated with inactive message channels. Furthermore, message channels which continuously fully utilize their window are controlled more frequently than message channels whose transmission power is less than the window allocated to them. This results in the window size of those message channels which always completely utilize their window being continuously increased further during operation without overload, on the one hand, in order to take account of their transmission power. On the other hand, these message channels likewise are controlled more frequently in the event of overload, so that the node is more effectively protected against being overloaded.

[0011] According to one advantageous embodiment of the present invention, the proposed method is coupled to a method for setting the window size for I/O overload such that its capacity is adequate. As such, in the event of an overload, the window size can be set to an optimum value in one step while, in contrast, during operation without any overload, the window size can be enlarged for message channels whose window is fully utilized.

[0012] Additional features and advantages of the present invention are described in, and will be apparent from, the following Detailed Description of the Invention and the Figures.

BRIEF DESCRIPTION OF THE FIGURES

[0013]FIG. 1 shows a flowchart of a method according to the teachings of the present invention.

DETAILED DESCRIPTION OF THE INVENTION

[0014] A node in a communication network to which message channels are connected and on which the SSCOP (Service Specific Connection Oriented Protocol) with SSCF UNI (Service Specific Coordination Function for the User-Network Interface) is used as a protector transmission protocol is considered as an exemplary embodiment. The window which is provided by the receiver for the traffic source is transmitted in a STAT message (status message) or a USTAT message (unsolicited status message) together with further status information to the traffic source. Status variables are maintained for each message channel. In this exemplary embodiment, the variable VR(H) is used, and is given the value of the highest sequence number of the received (not in sequence) messages. The variable ΔVR(H) is introduced as the change to VR(H) since the last measurement.

[0015] If ΔVR(H) reaches the current window size during an overload situation, the window is set to a reduced value. The new window size corresponds to the number of messages actually received during the measurement. The new window size is smaller than the previous size since messages are rejected in an overload situation; that is to say, ΔVR(H) is greater than the number of messages received since the start of the measurement.

[0016] If no overload is present, the window is enlarged in steps of 10 percent each.

[0017] This necessarily means that no measurements are carried out for inactive message channels.

[0018] Although the present invention has been described with reference to specific embodiments, those of skill in the art will recognize that changes may be made thereto without departing from the spirit and scope of the present invention as set forth in the hereafter appended claims. 

1. A method for flow control for a plurality of transmitters with a transmission power which is at least one of unknown and different, the method being carried out in a receiving device in a communication system, the method comprising the steps of: determining a number of messages which are received per message channel in the receiving device; and determining a new window size for each message channel as soon as the number of messages received per message channel exceeds a specific value, so as to influence the number of messages which a message source may send without acknowledgment.
 2. A method for flow control as claimed in claim 1, the method further comprising the steps of: storing a sequence number of a next message at a start of a control cycle; monitoring sequence numbers of subsequent messages; and comparing a difference between the current sequence number and the sequence number at the start of the control cycle with the window size.
 3. A method for flow control as claimed in claim 2, the method further comprising the step of setting a new window size if the difference between the current sequence number and the sequence number at the start of the control cycle at least reaches the current window size multiplied by a parameter.
 4. A method for flow control as claimed in claim 3, the method further comprising the step of choosing the parameter based on external influences which do not relate directly to the current window size.
 5. A method for flow control as claimed in claim 4, the method further comprising the steps of: carrying out an overload identification; choosing, in an overload situation, a new window size which is smaller than the current window size; and choosing, if no overload exists, a new window size such which is larger than the current window size.
 6. A method for flow control as claimed in claim 5, the method further comprising the steps of: determining the new window size, in order to reduce the size of the window, from the number of messages passed on in an overload situation from the receiving device to an upstream processing device; and enlarging the window by enlarging the current window by a specific percentage.
 7. A method for flow control as claimed in claim 1, wherein the control cycles are started at randomly selected times.
 8. A system for flow control for a plurality of transmitters with a transmission power which is at least one of unknown and different, the system being part of a receiving device in a communications system, the system comprising: parts for determining a number of messages received per message channel; and parts for determining a new window size for each message channel as soon as the number of messages received per message channel exceeds a specific value, wherein the system influences a number of messages which a message source may send without acknowledgment.
 9. A system for flow control as claimed in claim 8, wherein the system stores a sequence number of a next message at a start of a control cycle, monitors sequence numbers of subsequent messages, and compares a difference between the current sequence number and the sequence number at the start of the control signal with the window size.
 10. A system for flow control as claimed in claim 9, wherein the system sets a new window size if the difference between the current sequence number and the sequence number at the start of the control cycle at least reaches the current window size multiplied by a parameter.
 11. A system for flow control as claimed in claim 10, wherein the system chooses the parameter based on external influences which do not relate directly to the current window size.
 12. A system for flow control as claimed in claim 11, wherein the system carries out overload identification such that, in an overload situation, the system chooses a new window size which is smaller than the current window size and, if no overload exists, the system chooses a new window size which is larger than the current window size.
 13. A system for flow control as claimed in claim 12, wherein, in order to reduce the size of the window, the system determines the new window size from the number of messages passed on in an overload situation from the receiving device to an upstream processing device; and the system enlarges the size of the window by enlarging the current window by a specific percentage.
 14. A system for flow control as claimed in claim 8, wherein the system starts the control cycles at randomly chosen times. 